A Modal Deconstruction of Access Control Logics
نویسندگان
چکیده
We present a translation from a logic of access control with a “says” operator to the classical modal logic S4. We prove that the translation is sound and complete. We also show that it extends to logics with boolean combinations of principals and with a “speaks for” relation. While a straightforward definition of this relation requires second-order quantifiers, we use our translation for obtaining alternative, quantifierfree presentations. We also derive decidability and complexity results for the logics of access control.
منابع مشابه
Automating Access Control Logics in Simple Type Theory with LEO-II
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we c...
متن کاملNew Modalities for Access Control Logics: Permission, Control and Ratification
We present a new modal access control logic ACL to specify, reason about and enforce access control policies. The logic includes new modalities for permission, control, and ratification to overcome some limits of current access control logics. We present a Hilbert-style proof system for ACL and a sound and complete Kripke semantics for it. We exploit Kripke semantics to define Seq-ACL: a sound,...
متن کاملVariations in Access Control Logic
In this paper we investigate the design space of access control logics. Specifically, we consider several possible axioms for the common operator says. Some of the axioms come from modal logic and programming-language theory; others are suggested by ideas from security, such as delegation of authority and the Principle of Least Privilege. We compare these axioms and study their implications.
متن کاملLogics for Security and Privacy
In this presentation I first review new developments of deontic logic in computer science, then I discuss the use of dynamic epistemic deontic logic to reason about privacy policies, and finally I discuss the use of modal logic for access control. This presentation is based on joint work with Guillaume Aucher, Guido Boella, Jan Broersen, Dov Gabbay and Valerio Genovese.
متن کاملStable Modal Logics
We develop the theory of stable modal logics, a class of modal logics introduced in [3]. We give several new characterizations of stable modal logics, and show that there are continuum many such. Since some basic modal systems such as K4 and S4 are not stable, for a modal logic L, we introduce the concept of an L-stable extension of L. We prove that there are continuum many S4-stable modal logi...
متن کامل